Cumulants and Partition Lattices V. Calculating Generalized k-Statistics
نویسندگان
چکیده
منابع مشابه
Asymptotic Normality Through Factorial Cumulants and Partition Identities
In the paper we develop an approach to asymptotic normality through factorial cumulants. Factorial cumulants arise in the same manner from factorial moments as do (ordinary) cumulants from (ordinary) moments. Another tool we exploit is a new identity for 'moments' of partitions of numbers. The general limiting result is then used to (re-)derive asymptotic normality for several models including ...
متن کاملOn generalized topological molecular lattices
In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...
متن کاملCalculating excitation energies with the help of cumulants
Recently, it has been shown that the ground-state energy of a quantum many-body system can be written in terms of cumulants. In this paper we show that the energies of excited states can be expressed similarly. These representations are suitable for various approximation schemes, e.g., projection techniques. The explicit use of cumulants ensures size consistency in all approximations. The theor...
متن کاملPartition Statistics for Cubic Partition Pairs
In this brief note, we give two partition statistics which explain the following partition congruences: b(5n + 4) ≡ 0 (mod 5), b(7n + a) ≡ 0 (mod 7), if a = 2, 3, 4, or 6. Here, b(n) is the number of 4-color partitions of n with colors r, y, o, and b subject to the restriction that the colors o and b appear only in even parts.
متن کاملSet partition patterns and statistics
A set partition σ of [n] = {1, . . . , n} contains another set partition π if restricting σ to some S ⊆ [n] and then standardizing the result gives π. Otherwise we say σ avoids π. For all sets of patterns consisting of partitions of [3], the sizes of the avoidance classes were determined by Sagan and by Goyt. Set partitions are in bijection with restricted growth functions (RGFs) for which Wach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1988
ISSN: 0263-6115
DOI: 10.1017/s1446788700029773